Location:
Search - 01 knapsack
Search list
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。
Platform: |
Size: 201710 |
Author: gouyabin |
Hits:
Description: 采用分枝限界法解决0/1背包问题!
本人上机实习作业,通过老师验收,合格!
针对部分上机实习的同学可以来下~-used Branch and Bound France 0/1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the next ~
Platform: |
Size: 1024 |
Author: 张锐 |
Hits:
Description: 背包问题优先队列分枝限界算法
所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method.
Platform: |
Size: 238592 |
Author: 王涛 |
Hits:
Description: 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
Platform: |
Size: 1024 |
Author: xieyixin |
Hits:
Description: 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal operating handle condemnation
Platform: |
Size: 2736128 |
Author: yuanjianping |
Hits:
Description: 01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包...但它却是另一个重要的背包问题P02最简捷的解决方案,故学习只用一维数组解01背包问题是十分必要的。-01 knapsack problem subject N items and a capacity of V backpack. The first i items cost c [i], the value of w [i]. Solution which items will be loaded backpack ... but it is another important knapsack problem P02 the most simple and quickest solution, it is to learn only one-dimensional array of 01 knapsack problem solution is very necessary.
Platform: |
Size: 238592 |
Author: 0000 |
Hits:
Description: 01背包问题的C++源程序，写的比较简单-01 knapsack problem C++ Source code, written in relatively simple
Platform: |
Size: 49152 |
Author: sandy chen |
Hits:
Description: 01背包问题的优先队列式分枝限界算法程序LCKNAP-01 knapsack problem the priority queue algorithm Branch and Bound-style program LCKNAP
Platform: |
Size: 8192 |
Author: lv |
Hits:
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever, then it is better not to look at this issue.
Platform: |
Size: 201728 |
Author: gouyabin |
Hits:
Description: 用遗传算法解决01背包问题，内附测试数据。-Using genetic algorithms to solve knapsack problem 01, enclosing the test data.
Platform: |
Size: 266240 |
Author: 蓝点 |
Hits:
Description: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Platform: |
Size: 22528 |
Author: lius |
Hits:
Description: c++利用回溯法来实现01背包问题
阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem
Stage: the first N items, select the number of items into the backpack status is: the first N items, select the number of items into the remaining space in the backpack for the W available to the greatest value Decision-making is: The first N items put or hold
Platform: |
Size: 884736 |
Author: 林挺 |
Hits:
Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
Platform: |
Size: 778240 |
Author: hudongfang |
Hits:
Description: 01背包问题的解决方法很多，下面用遗传算法解决01背包问题-01 knapsack problem genetic algorithm to solve
Platform: |
Size: 4096 |
Author: lixingze |
Hits:
Description: 01背包问题，有很多方法可以解决，下面采用动态规划的方法。-01 knapsack problem, there are many ways to solve
Platform: |
Size: 1024 |
Author: lixingze |
Hits:
Description: 01背包动态规划算法,实现01背包算法的一个简单例子-01 knapsack dynamic programming algorithm to achieve 01 knapsack algorithm is a simple example
Platform: |
Size: 258048 |
Author: 骆芷茵 |
Hits:
Description: 遗传算法求解01背包问题，代码、文档都有-01 knapsack problem genetic algorithm, code, documentation has
Platform: |
Size: 201728 |
Author: 高某某 |
Hits:
Description: 用粒子群算法解决01背包问题（100个物品）从而得到最优解(The particle swarm algorithm is used to solve the 01 knapsack problem (100 items), and thus the optimal solution is obtained)
Platform: |
Size: 5396480 |
Author: 我家门朝南
|
Hits:
Description: 用动态规划解决01背包问题，以及回溯找到最终解，完美的解决了动态规划的思想(Use dynamic programming to solve the 01 knapsack problem.)
Platform: |
Size: 3840000 |
Author: 莫忘莫失 |
Hits:
Description: 使用遗传算法解决01背包问题，并输出得到最大价值的遗传代数以及每一代的最大价值(Using genetic algorithm to solve 01 knapsack problem)
Platform: |
Size: 2048 |
Author: 23258hyw |
Hits: